Optimizing the Dynamic Distribution of Data-stream for High Speed Communications

The performances of high-speed network communications frequently rests with the distribution of data-stream. In this paper, a dynamic data-stream balancing architecture based on link information is introduced and discussed firstly. Then an algorithm for simultaneously obtaining the passing nodes and links of a path between any two source-destination nodes rapidly, as well as a dynamic data-stream distribution planning is proposed. Some related topics such as data fragment disposal, fair service, etc. are further studied and discussed. Besides, the performance and efficiency of proposed algorithms, especially for fair service and convergence, are evaluated through a demonstration with regard to the rate of bandwidth utilization. Hoping the discussion presented here can be helpful to application developers in selecting an effective strategy for the distribution of data-stream. Index Terms —Data-stream balancing, Adjacency matrix, Service metric, Link information, Non-directional graph, Fair service.